Asymptotic Approximation by Quadratic Spline Curves
نویسنده
چکیده
For a planar curve C with positive affine curvature, we derive an asymptotic formula for the area approximation by quadratic spline curves with n knots lying on C. The order of approximation is 1/n4 and the formula depends on an integral over the affine curvature. 1991 AMS subject classification: 52A10, 53A04, 53A15, 41A15, 41A50
منابع مشابه
Rational quadratic approximation to real algebraic curves
An algorithm is proposed to give a global approximation of an implicit real plane algebraic curve with rational quadratic B-spline curves. The algorithm consists of four steps: topology determination, curve segmentation, segment approximation and curve tracing. Due to the detailed geometric analysis, high accuracy of approximation may be achieved with a small number of quadratic segments. The f...
متن کاملOptimal Spline Approximation via ℓ0-Minimization
Splines are part of the standard toolbox for the approximation of functions and curves in Rd . Still, the problem of finding the spline that best approximates an input function or curve is ill-posed, since in general this yields a “spline” with an infinite number of segments. The problem can be regularized by adding a penalty term for the number of spline segments. We show how this idea can be ...
متن کاملApproximation with Active B-Spline Curves and Surfaces
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization algorithm. The quasi-Newton optimization procedure in each iteration step minimizes a quadratic function which is built up with help of local quadratic approximants of the squared distance function of the model shape and...
متن کاملBisection algorithms for approximating quadratic Bézier curves by G1 arc splines
To describe the tool path of a CNC machine, it is often necessary to approximate curves by G arc splines with the number of arc segments as small as possible. Ahn et al. have proposed an iterative algorithm for approximating quadratic Bézier curves by G arc splines with fewer arc segments than the biarc method. This paper gives the formula of the upper bound for arc segments used by their algor...
متن کاملApproximation of curves by fairness splines with tangent conditions
We present in this paper an approximation method of curves from sets of Lagrangian data and vectorial tangent subspaces. We de1ne a discrete smoothing fairness spline with tangent conditions by minimizing certain quadratic functional on 1nite element spaces. Convergence theorem is established and some numerical and graphical examples are analyzed in order to show the validity and the e4ectivene...
متن کامل